Minimizing the Impact of Buffer Overflow in DTN
نویسندگان
چکیده
In epidemic routing for a DTN, it is well-known that message drop degrades the delivery ratio. To minimize the degradation, we need to protect messages with a small number of copies in a DTN. In this paper, we propose a new drop policy which drops a message with the largest expected number of copies first to minimize the impact of message drop.
منابع مشابه
A New Approach of Enhanced Buffer Management Policy in Delay Tolerant Network (DTN)
Delay tolerant-network is emerging technology in wireless communication. This network is applied generally when there is no end-to-end path from source to destination. In current TCP/IP technology communication is possible only when end-to-end path is available. But two major issues in DTN (Abbreviation) are routing and buffer management. Routing strategy determine which message should be forwa...
متن کاملA Study of Dynamic Prediction Based Multi-queue (dpmq) Drop Policy in Ferry Based Protocols for Disconnected Mobile Ad Hoc Networks
Delay Tolerant Network (DTN) is an approach to address the technical issues in heterogeneous networks that may lack continuous network connectivity. The issues that are related to DTN are delivery probability, overhead, latency and drop rate. To improve message delivery probability and reduce network overhead, routing protocol and buffer management has to be selected efficiently. This scheme is...
متن کاملHeuristic Congestion Control for Message Deletion in Delay Tolerant Network
Delay tolerant network (DTN) challenges on large delay of communication, opportunistic and intermittent connectivity so that data can be transferred over vulnerable network. Most routing protocols in DTN basing on replicating routing work well over infinite buffer assumption but the performance drops when using with finite buffer due to the congestion problem. However, it is still lack of work ...
متن کاملInteger Coding with Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial P for which known methods find a source code that is optimal in the sense of minimizing expected codeword length. For some applications, however, a source code should instead minimize one of a fam...
متن کاملInter-ring Traffic Management in Bridged Resilient Packet Rings: Global Fairness and Buffer Overflow Prevention
Resilient Packet Ring (RPR) is a dual-ring network, also known as the IEEE 802.17 Standard. As with other IEEE 802 networks, multiple RPR networks can be bridged together to form a bridged network when necessary. However, further research is necessary on additional issues that arise from bridging RPR networks. In this paper, we place emphasize on two of these issues; that is, fairness for inter...
متن کامل